COMMENT ⊗   VALID 00004 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Klein, S., Aeschlimann, J., Balsiger, D., Converse, S., Court, C., Foster, M.,
C00009 00003	Cadiou, J.M. and Levy, J.J., MECHANIZABLE PROOFS ABOUT PARALLEL PROCESSES.
C00017 00004	Hueckel, Manfred, A LOCAL VISUAL OPERATOR WHICH RECOGNIZES EDGES AND LINES.
C00020 ENDMK
C⊗;
Klein, S., Aeschlimann, J., Balsiger, D., Converse, S., Court, C., Foster, M.,
Lao, R., Oakley, J., Smith, J., AUTOMATIC NOVEL WRITING: A STATUS REPORT.
U of W-Madison, 109 pages.

Bolt, Beranek, and Newman, Inc., INTERFACE MESSAGE PROCESSORS FOR THE ARPA 
COMPUTER NETWORK (QUARTERLY TECHNICAL REPORT NO. 2). 15 pages.

Walker, Donald, SPEECH UNDERSTANDING THROUGH SYNTACTIC AND SEMANTIC ANALYSIS.
SRI, 8 pages.

Paxton, William and Robinson, Ann, A PARSER FOR A SPEECH UNDERSTANDING SYSTEM.
SRI, 7 pages.

Backus, John, PROGRAMMING LANGUAGE SEMANTICS AND CLOSED APPLICATIVE LANGUAGES.
IBM Research, 38 pages.

Kimball, Ralph, SELF-OPTIMIZING COMPUTER-ASSISTED TUTORING:  THEORY AND PRACTICE.
Stanford IMSSS, 132 pages.

Van Campen, Joseph, A COMPUTER-BASED INTRODUCTION TO THE MORPHOLOGY OF OLD CHURCH
SLAVONIC.  Stanford IMSSS, 34 pages.

Linn, John, GENERAL METHODS FOR PARALLEL SEARCHING.  Stanford SEL, 131 pages.

Bonneau, Richard, POLYNOMIAL EXPONENTIATION:  THE FAST FOURIER TRANSFORM REVISITED.
MIT, Project MAC, 35 pages.

REPORT BY THE COMMITTE ON MOTOR VEHICLE EMISSIONS.  NAS, 140 pages.

Savage, John, ON THE PERFORMANCE OF COMPUTING SYSTEMS.  Brown U. 38 pages.

Walk, Kurt, MODELING OF STORAGE PROPERTIES OF HIGHER-LEVEL LANGUAGES. IJCIS, 24 pages.

Walker, Donald, AUTOMATED LANGUAGE PROCESSING. SRI, 85 pages.

Wulf, Cohen, Corwin, Jones, Levin, Pierson, Pollack, HYDRA: THE KERNEL OF A 
MULTIPROCESSOR OPERATING SYSTEM.  CMU, 24 pages.

COMPUTER SCIENCE DEPARTMENT COURSE EVALUATION RESULTS (SPRING 72-73).

FIRBUSH NEWS 3. 69 pages.

Johnsson, Richard, A SURVEY OF REGISTER ALLOCATION.  CMU, 23 pages.

Oestreicher, Donald, A MICROPROGRAMMING LANGUAGE FOR THE MLP-900. USC/ISI, 7 pages.

Gordon, M.J.C., AN INVESTICATION OF LIT.  AI Edinburgh, 24 pages.

Muntz, Richard and Baskett, Forest, OPEN, CLOSED, AND MIXED NETWORKS OF QUEUES WITH
DIFFERENT CLASSES OF CUSTOMERS. Stanford SEL, 46 pages.

Ota, Peggy, MOSAIC GRAMMARS.  U of Penn. MSEE, 178 pages.

DISCRETE MANUFACTURING INDUSTRIES "AUTOMATION NEEDS".  U OF MICH., @ 175 pages.

AIR QUALITY CRITERIA FOR PHOTOCHEMICAL OXIDANTS. HEW, @75 pages.

Madnick, Stuart, STORAGE HIERACHY SYSTEMS.  MIT Project MAC, 155 pages.

Pratt, William, IMAGE PROCESSING RESEARCH (SEMIANNUAL TECHNICAL REPORT).  USC,
144 pages.

Klein, Sheldon, AUTOMATIC INFERENCE OF SEMNTIC DEEP STRUCTURE RULES IN GENERATIVE
SEMANTIC GRAMMARS.  U OF WISC.-MADISON, 25 pages.

GENERAL SURVEY OF INFORMATION PROCESSING IN JAPAN, #15, 16, 17. JIPDEC, @30 pages.

Gagliardo, E., ENGLISH TRANSLATION OF THE PAPER ABIOSOFOS 1972.  ORE. STATE U,
62 pages.

Moll, Robert, AN OPERATOR EMBEDDING THEOREM FOR COMPLEXITY CLASSES OF RECURSIVE
FUNCTIONS.  MIT Project MAC, 11 pages.

Bobrow, D.G., LOLLY: A POP-2 INTERPRETER AND COMPILER FOR LOGO A CHILDREN'S 
PROGRAMMING LANGUAGE.  AI Edinburgh, 25 pages.

Ferrante, Jeanne and Rackoff, Charles, A DECISION PROCEDURE FOR THE FIRST ORDER 
THEORY OF REAL ADDITION WITH ORDER.  MIT Project MAC,16 pages.

Ernst, George, A DEFINITION-DRIVE THEOREM PROVER.  Case Western Reserve U., 27 pages.

Barbacci, M.R., A COMPARISON OF REGISTER TRANSFER LANGUAGES FOR DESCRIBING COMPUTERS
AND DIGITAL SYSTEMS.  CMU, 37 pages.

COMPUTER ELEMENTS AND SYSTEMS (ISSUES #38-40 1970). Akademiya Nauk SSSR. 329 pages.

Huff, George, GEOMETRY AND FORMAL LINGUISTICS.  Stanford IMSSS, 58 pages.

Wegbreit, B., Brosgol, B., Holloway, G., Prenner, C., Spitzen, J., ECL PROGRAMMER'S
MANUAL.  Harvard, 105 pages.

Shostak, Robert, ON SEPARATING THE FIRST-ORDER FROM THE PROPOSITIONAL IN RESOLUTION
THEOREM PROVING.  Harvard, 9 pages.

Lewis, Harry, PROGRAM SCHEMATA AND THE FIRST-ORDER DECISION PROBLEM.  HARVARD, 
28 pages.

Downey, Peter, UNDECIDABILITY OF PRESBURGER ARITHMETIC WITH A SINGLE MONADIC 
PREDICATE LETTER.  Harvard, 16 pages.

Baran, Paul and Lipinski, Andrew, THE FUTURE OF THE TELEPHONE INDUSTRY 1970-1985.
Inst. for the Future, 172 pages.

Fawcett, Barry, AUTOMATH: A LANGUAGE FOR MATHEMATICS.  U of Montreal, 60 pages.
Cadiou, J.M. and Levy, J.J., MECHANIZABLE PROOFS ABOUT PARALLEL PROCESSES.
IEEE, 16 pages.

Moll, Robert, COMPLEXITY CLASSES OF RECURSIVE FUNCTIONS.  MIT Project MAC, 95 pages.

De Bruijn, N.G., LAMBDA CALCULUS NOTATION WITH NAMELESS DUMMIES, A TOOL FOR AUTOMATIC
FORMULA MANIPULATION, WITH APPLICATION TO THE CHURCH-ROSSER THEOREM.  Amsterdam,
12 pages.

De Bruijn, N.G., SET THEORY WITH TYPE RESTRICTIONS.  Hungary, 12 pages.

Newell, Allen, PRODUCTIONS SYSTEMS:  MODELS OF CONTROL STRUCTURES.  CMU, 64 pages.

Reboh, Rene and Sacerdoti, Earl, A PRELIMINARY QLISP MANUAL.  SRI, 35 pages.

Charrow, V.R. and Fletcher, J.D., ENGLISH AS THE SECOND LANGUAGE OF DEAF STUDENTS.
Stanford IMSSS, 31 pages.

Fletcher, J.D., TRANSFER FROM ALTERNATIVE PRESENTATIONS OF SPELLING PATTERNS IN 
INITIAL READING.  Stanford IMSSS, 66 pages.

Martin, Nancy, CONVERGENCE PROPERTIES OF A CLASS OF PROBABILISTIC ADAPTIVE SCHEMES
CALLED SEQUENTIAL REPRODUCTIVE PLANS.  Stanford IMSSS, 53 pages.

Kernighan, B.W., Ritchie, D.M., Thompson, K.L., QED TEXT EDITOR.  Bell Labs, 24 pages.

Gavrilovic, Momcilo, OPTIMAL PATH PLANNING FOR MANIPULATION AND LEGGED LOCOMOTION
SYSTEMS.  Mihaio Pupin Institute, @75 pages.

Simon, Herbert a., THE STRUCTURE OF ILL STRUCTURED PROBLEMS.  CMU, 30 pages.

Gorn, Saul, HOW DO YOU KNOW IT HAS TO WORK? (ON THE CONCLUSIVE VALIDATION OF SYMBOL
MANIPULATIVE PROCESS).  U. of Penn. MSEE, 39 pages.

Kamrany, Nake, A PRELIMINARY ANALYSIS OF THE ECONOMIC IMPACTS OF PROGRAMMABLE 
AUTOMATION UPON DISCRETE MANUFACTURING INDUSTRIES.  USC/ISI, 73 pages.

INTERIM DESCRIPTION AND GUIDELINES FOR PROPOSAL PREPARATION.  NSF, 10 pages.

Kareev, Yaakov, A MODEL OF HUMAN GAME PLAYING.  UCSD, 74 pages.

Norman, Donald, COGNITIVE ORGANIZATION AND LEARNING.  UCSD, 35 pages.

Rumelhart, David and Norman, Donald, ACTIVE SEMANTIC NETWORKS AS A MODEL OF HUMAN
MEMORY.  UCSD, 17 pages.

Debry, Roger and Greenfield, Harvey, SIMULATION OF ARBITRARY SHAPED BOUNDARIES FOR
HEMODYNAMIC STUDIES.  U of Utah, 265 pages.

Deutsch, L. P., AN INTERACTIVE PROGRAM VERIFIER.  XEROX-PARC, @100 pages.

Ambler, A.P., Barrow, H.G., Brown, C.M., Burstall, R.M.,Popplestone, R. J., A
VERSATILE COMPUTER-CONTROLLED ASSEMBLY SYSTEM.  AI Edinburgh, @20 pages.

RESEARCH HIGHLIGHTS 1972, Lawrence Berkeley Laboratory, 60 pages.

Walker, Donald, AUTOMATED LANGUAGE PROCESSING.  SRI, 85 pages.

Sacerdoti, Earl, PLANNING IN A HIERARCHY OF ABSTRACTION SPACES.  SRI, @15 pages.

Nilsson, Nils, A HIERARCHICAL ROBOT PLANNING AND EXECUTION SYSTEM.  SRI, 27 pages.

Shaw, Mary (ed.), IC STUDY PROBLEMS.  CMU, 94 pages.

SEMI-ANNUAL STATUS REPORT NO. 124. Stanford SEL, @70 pages.

Kolupaev, Stephen, SELF-TESTING RESIDUE TREES.  Stanford SEL, 47 pages.

Bredt, Thomas H., A SYNTAX-DIRECTED METHOD FOR OPERATING SYSTEM DESIGN.  Stanford
DSL, 24 pages.

Wilhelm, Neil, SIMPLE PROPERTIES OF LAST-COME-FIRST-SERVED PREEMPTIVE-RESUME 
QUEUES WITH POISSON ARRIVALS AND ARBITRARY SERVICE TIMES.  Stanford DSL, 9 pages.

Wakerly, John F., DETECTION OF UNIDIRECTIONAL MULTIPLE ERRORS USING LOW-COST 
ARITHMETIC CODES.  Stanford DSL, 10 pages.

Ogus, Roy C., FAULT-TOLERANCE OF THE ITERATIVE CELL ARRAY SWITCH FOR HYBRID 
REDUNDANCY THROUGH THE USE OF FAILSAFE LOGIC. Stanford DSL, 66 pages.

Searle, Barbara, Lorton, Paul, Suppes, Patrick, STRUCTURAL VARIABLES AFFECTING CAI
PERFORMANCE ON ARITHMETIC WORD PROBLEMS OF DISADVANTAGED AND DEAF STUDENTS.  Stanford,
IMSSS, 27 pages.

Walker, Donald E, SPEECH UNDERSTANDING, COMPUTATIONAL LINGUISTICS, AND ARTIFICIAL
INTELLIGENCE.  SRI, 16 pages.

Tjaden, G. S., Flynn, M. J., REPRESENTATION OF CONCURRENCY WITH ORDERING MATRICES.
IEEE, 10 pages.

Ledgard, Henry, PRODUCTION SYSTEMS:  A FORMALISM FOR DEFINING THE SYNTAX AND
TRANSLATION OF PRACTICAL PROGRAMMING LANGUAGES.  Johns Hopkins, 51 pages.

Agerwala, Tilak, COMMENTS ON CAPABILITIES, LIMITATIONS AND "CORRECTNESS" OF 
PETRI NETS.  Johns Hopkins, 58 pages.

Fuller, S. H., Gaschnig, J. G., Gillogly, J. J., ANALYSIS OF THE ALPHA-BETA 
PRUNING ALGORITHM.  CMU, 51 pages.

Gerhardt, Douglas, Parnas, D. L., WINDOW:  A FORMALLY-SPECIFIED GRAPHICS-BASED
TEXT EDITOR.  CMU, 34 pages.

Kosaraju, S. Rao, LIMITATIONS OF DIJKSTRA'S SEMAPHORE PRIMITIVES AND PETRI NETS.
Johns Hopkins, 5 pages.

Habermann, A. N., CRITICAL COMMENTS ON THE PROGRAMMING LANGUAGE PASCAL.  CMU,
19 pages.

Hollander, Clifford R., DECOMPILATION OF OBJECT PROGRAMS.  Stanford, SEL, 
175 pages

Lee, Hsiao-Peng Sherman, Davidson, Edward, REDUNDANCY TESTING IN COMBINATIONAL
NETWORKS.  Stanford, SEL, 67 pages.

Swanson, Roger C., INTERCONNECTIONS FOR PARALLEL MEMORIES TO UNSCRAMBLE p-ORDERED
VECTORS, Stanford, SEL, 48 pages.

Lee, Hsiao-Peng Sherman, AN ALGORITHM FOR MINIMAL TANT NETWORK GENERATION.  Stanford,
SEL, 78 pages.

Salisbury, Alan B., A STUDY OF GENERAL-PURPOSE MICROPROGRAMMABLE COMPUTER 
ARCHITECTURES.  Stanford, SEL, 79 pages.
Hueckel, Manfred, A LOCAL VISUAL OPERATOR WHICH RECOGNIZES EDGES AND LINES.
Stanford, 14 pages.

Wand, Mitchell, MATHEMATICAL FOUNDATIONS OF FORMAL THEORY.  MIT-MAC, 224 pages.

Linderman, John P., PRODUCTIVITY IN PARALLEL COMPUTATION SCHEMATA.  MIT-MAC,
152 pages.

Hawryszkiewycz, Igor Titus, SEMANTICS OF DATA BASE SYSTEMS.  MIT-MAC, 349 pages.

Wilhelm, Neil C., ANALYSIS OF FCFS AND SSTF SEEK SCHEDULING USING AN EMPIRICAL
MODEL FOR DISC ACCESSES.  Stanford-SEL, 39 pages.

Wilhelm, Neil C., A GENERAL MODEL FOR THE PERFORMANCE OF DISC SYSTEMS.  
Stanford-SEL, 49 pages.

Swanson, Roger C., INTERCONNECTIONS FOR PARALLEL MEMORIES TO UNSCRAMBLE 
p-ORDERED VECTORS, Stanford-SEL, 54 pages.

Metcalfe, Robert M., PACKET COMMUNICATION.  MIT-MAC, 100+ pages.

Geiger, Steven P., A USER'S GUIDE TO THE MACRO CONTROL LANGUAGE.  MIT-MAC,
38 pages.

Nevins, J. L., Whitney, D. E., Simunovic, S. N., SYSTEM ARCHITECTURE FOR ASSEMBLY 
MACHINES, Charles Stark Draper Lab, 113 pages.

Herrmann, Paul Peter, ON REDUCIBILITY AMONG COMBINATORIAL PROBLEMS.  MIT-MAC,
32 pages.

Meyer, Albert B., WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-
RECURSIVE.  MIT-MAC, 24 pages.

Meyer, Albert R., DISCRETE COMPUTATION:  THEORY AND OPEN PROBLEMS. MIT-MAC, 
35 pages.

Moore, J., Newell, A., HOW CAN MERLIN UNDERSTAND?  CMU, 57 pages.

Ono, Hiroakira, A FORMAL SYSTEM OF PARTIAL RECURSIVE FUNCTIONS.  Tsuda College,
28 pages.

Fischer, Michael J., Paterson, Michael S., STRING-MATCHING AND OTHER PRODUCTS.
MIT-MAC, 21 pages.